Congruences for Some Combinatorial Numbers via Finite Automata
نویسندگان
چکیده
Finite automata can be useful for proving the congruences for combinatorial numbers. We offer several examples as applications: First we consider the congruence of central Delannoy numbers module 3, then we find the congruences of the number of graphs and the number of total edges for noncrossing connected graphs module 3. One of these results answers a conjecture of Deutsch and Sagan in affirmative. Finally we give a fast algorithm for computing the parity of Narayana numbers.
منابع مشابه
Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملCongruences via Abelian Groups
Given a group G acting on a set S, Mobius inversion over the lattice of subgroups can be used to obtain congruences relating the number of elements of S stabilized by each subgroup. By taking S to be a set of subsets, partitions, or permutations congruences for binomial and multinomial coefficients. Stirling numbers of both kinds, and various other combinatorial sequences are derived. Congruenc...
متن کاملA Generalization of the Genocchi Numbers with Applications to Enumeration of Finite Automata
We consider a natural generalization of the well studied Genocchi numbers This generalization proves useful in enumerating the class of deterministic nite automata DFA which accept a nite language We also link our generalization to the method of Gandhi polynomials for generating Genocchi numbers Introduction and Motivation The study of Genocchi numbers and their combinatorial interpretations ha...
متن کاملOn congruences of automata defined by directed graphs
Graphs and various objects derived from them are basic essential tools that have been actively used in various branches of modern theoretical computer science. In particular, graph grammars and graph transformations have been very well explored in the literature. We consider finite state automata defined by directed graphs, characterize all their congruences, and give a complete description of ...
متن کاملGeneralized Directable Automata
In [18] the last three authors introduced the notion of a generalized directable automaton as a generalization of many already known types of automata. The algorithms for testing whether a finite automaton belongs to some of important subclasses of the class of generalized directable automata are studied by the authors in [20]. In this paper structural properties of finite and infinite generali...
متن کامل